runtime.mspan.next (field)

28 uses

	runtime (current package)
		arena.go#L331: 		a.fullList = s.next
		arena.go#L332: 		s.next = nil
		arena.go#L393: 		s.next = a.fullList
		mheap.go#L422: 	next *mspan     // next span in list, or nil if none
		mheap.go#L1787: 	span.next = nil
		mheap.go#L1832: 		list.first = span.next
		mheap.go#L1834: 		span.prev.next = span.next
		mheap.go#L1839: 		span.next.prev = span.prev
		mheap.go#L1841: 	span.next = nil
		mheap.go#L1851: 	if span.next != nil || span.prev != nil || span.list != nil {
		mheap.go#L1852: 		println("runtime: failed mSpanList.insert", span, span.next, span.prev, span.list)
		mheap.go#L1855: 	span.next = list.first
		mheap.go#L1869: 	if span.next != nil || span.prev != nil || span.list != nil {
		mheap.go#L1870: 		println("runtime: failed mSpanList.insertBack", span, span.next, span.prev, span.list)
		mheap.go#L1876: 		list.last.next = span
		mheap.go#L1893: 	for s := other.first; s != nil; s = s.next {
		mheap.go#L1902: 		other.last.next = list.first
		mheap.go#L1920: 	if s.next != nil {
		mheap.go#L1926: 		q.tail.next = s
		mheap.go#L1938: 	q.head = s.next
		mheap.go#L1939: 	s.next = nil
		mheap.go#L1955: 		q1.tail.next = q2.head
		mheap.go#L1979: 		s = s.next
		mheap.go#L1985: 	q.head = s.next
		mheap.go#L1986: 	s.next = nil
		stack.go#L1299: 			next := s.next
		stack.go#L1315: 			next := s.next